Multi-k-ic Depth Three Circuit Lower Bound

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Depth 3 Circuit Lower Bound for the Parity Function

The goal of computational complexity is to measure the amount of resources needed to perform certain computations. There has been great progress in finding upper bounds (algorithms) for many problems. However, it is still very difficult to find lower bounds for problems over general computational models, such as Turing machine or the circuit model with a complete basis. Many key open problems i...

متن کامل

An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits

We show an Ω ( n (lnn)3 ) lower bound on the number of gates of any depth three (ΣΠΣ) arithmetic circuit computing an explicit multilinear polynomial in n variables over any field. This improves upon the previously known quadratic lower bound by Shpilka and Wigderson [SW99, SW01].

متن کامل

Depth lower bound for matching

Definition 2.1. Let f : X × Y → V . A subset R of X × Y is a rectangle1 if it is of the form A × B for some A ⊆ X and B ⊆ Y . The rectangle R is said to be monochromatic (wrt. f) if f is constant on R. A monochromatic rectangle R is a 0-rectangle if f(R) = {0}; it is a 1-rectangle if f(R) = {1}. Observation 2.2. A subset S of X × Y is a rectangle iff for all x, x′ ∈ X and y, y′ ∈ Y (x, x′) ∈ S ...

متن کامل

Lower Bound Frontiers in Arithmetical Circuit Complexity

Acknowledgement I would like to thank my advisor Kenneth Regan for introducing me to the study of computational complexity. Thank you for your guidance and encouragement. The last six years have been great working together. Thank you also for teaching me how to teach. I would like to thank Alan Selman and Xin He for being on the Ph.D. committee and Martin Lotz for his work as the outside reader...

متن کامل

Monotone depth lower bound for st connectivity

In Lecture 2, we saw how communication complexity lower bounds yield lower bounds for circuit depth. In particular, we showed that for any function f , D(KWf ) = depth(f) and D(KW f ) = depth (f), where KWf denotes the Karchmer-Wigderson game on f . Using this, we showed that monotone circuits for matching require Ω(n) depth. In this lecture we will show that circuits solving directed s-t conne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory of Computing Systems

سال: 2016

ISSN: 1432-4350,1433-0490

DOI: 10.1007/s00224-016-9742-9